Compositional Model Checking
نویسندگان
چکیده
We describe a method for reducing the complexity of temporal logic model checking in systems composed of many parallel processes. The goal is to check properties of the components of a system and then deduce global properties from these local properties. The main difficulty with this type of approach is that local properties are often not preserved at the global level. We present a general framework for using additional interface processes to model the environment for a component. These interface processes are typically much simpler than the full environment of the component By composing a component with its interface processes and then checking properties of this composition, we can guarantee that these properties will be preserved at the global level. We give two example compositional systems based on the logic CTL*. This research was sponsored in part by the Defense Advanced Research Projects Agency (DOD), ARPA Order No. 4976, Amendment 20, under Contract Number F33615-87-C-1499, monitored by the: Avionics Laboratory, Air Force Wright Aeronautical Laboratories, Aeronautical Systems Division (AFCS), and Wright-Patterson AFB, Ohio 45433-6543. This research was also partially supported by NSF grant CCR-87-226-33. The second author holds an NSF graduate fellowship. The views and conclusions contained in this document are those of the authors and and should not be interpreted as representing the official policies, either expressed or implied, of the Defense Advanced Research Projects Agency, the National Science Foundation or the U.S. Government.
منابع مشابه
A Survey on Compositional Veri cation
In this survey, we overview several compositional veriication approaches based on model checking, namely compositional minimization, classic assume guarantee reasoning and circular reasoning. We describe details of each of these approaches, and elaborate the general problems with some proposed solutions. We also summarize the advantages and disadvantages of each. In the last section, we give a ...
متن کاملCompositional model checking of monadic least fixed point logic
Compositional model checking refers to reducing the problem of model checking some property of the whole system to the problem of model checking its components. In this paper, we investigate compositional approach for model checking monadic least fixed point logic on transition systems assembled from the components by using the H-sum and the fusion operator. 1 Research Area – Main Themes The ma...
متن کاملCompositional Speciication and Veriication of Control Ow Based Security Properties of Multi-application Programs
Jensen et al. present a simple and elegant program model, within a speciication and veriication framework for checking control ow based security properties by model checking techniques. We gener-alise this model and framework to allow for compositional speciication and veriication of security properties of multi-application programs. The framework contains a program model for multi-application ...
متن کاملA Compositional Proof System for the Modal -Calculus
We present a proof system for determining satisfaction between processes in a fairly general process algebra and assertions of the modal -calculus. The proof system is compositional in the structure of processes. It extends earlier work on compositional reasoning within the modal -calculus and combines it with techniques from work on local model checking. The proof system is sound for all proce...
متن کاملCompositional Reasoning in Model Checking
The main problem in model checking that prevents it from being used for veri cation of large systems is the state explosion problem. This problem often arises from combining parallel processes together. Many techniques have been proposed to overcome this di culty and, thus, increase the size of the systems that model checkers can handle. We describe several compositional model checking techniqu...
متن کاملA Compositional Proof System for theModal
We present a proof system for determining satisfaction between processes in a fairly general process algebra and assertions of the modal-calculus. The proof system is compositional in the structure of processes. It extends earlier work on compositional reasoning within the modal-calculus and combines it with techniques from work on local model checking. The proof system is sound for all process...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1989